Multi-exponentiation (cryptographic protocols)
نویسندگان
چکیده
منابع مشابه
Mobile Agent Security Through Multi-Agent Cryptographic Protocols
We consider the problem of keeping sensitive data and algorithms contained in a mobile agent from discovery and exploitation by a malicious host. The focus in this paper is on rigorous techniques based on cryptographic protocols. Algesheimer, Cachin, Camenisch, and Karjoth (IEEE Security and Privacy, 2001) devised a secure agent protocol in such a setting, where agents and hosts are mutually di...
متن کاملMulti-partite quantum cryptographic protocols with noisy GHZ States
We propose a wide class of distillation schemes for multi-partite entangled states that are CSS-states. Our proposal provides not only superior efficiency, but also new insights on the connection between CSS-states and bipartite graph states. We then apply our distillation schemes to the tri-partite case for three cryptographic tasks—namely, (a) conference key agreement, (b) quantum sharing of ...
متن کاملAlgorithms for Multi-exponentiation
This paper compares different approaches for computing power products ∏ 1≤i≤k g ei i in commutative groups. We look at the conventional simultaneous exponentiation approach and present an alternative strategy, interleaving exponentiation. Our comparison shows that in general groups, sometimes the conventional method and sometimes interleaving exponentiation is more efficient. In groups where in...
متن کاملProgramming Cryptographic Protocols
Cryptographic protocols are useful for trust engineering in distributed transactions. Transactions require specific degrees of confidentiality and agreement between the principals engaging in it. Moreover, trust management assertions may be attached to protocol actions, constraining the behavior of a principal to be compatible with its own trust policy. We embody these ideas in a cryptographic ...
متن کاملLecture Notes Cryptographic Protocols
ii iii Preface In this course, we focus on asymmetric techniques for cryptographic protocols, also considering proofs of security for various constructions. Motivating example: 'Sinterklaaslootjes trekken' is a Dutch tradition for buying presents and writing little poems, see, The same tradition is also known as " Secret Santa " , and a lot of websites and programs are available to help people ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEE Proceedings - Computers and Digital Techniques
سال: 1994
ISSN: 1350-2387
DOI: 10.1049/ip-cdt:19941271